Approximation algorithm for the kinetic robust K-center problem
نویسندگان
چکیده
منابع مشابه
Approximation algorithm for the kinetic robust K-center problem
Clustering is an important problem and has numerous applications. In this paper we consider an important clustering problem, called the k-center problem. We are given a discrete point set S and a constant integer k, and the goal is to compute a set of k center points to minimize the maximum distance from any point of S to its closest center. We consider both the discrete formulation, in which c...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولA hybrid metaheuristic algorithm for the robust pollution-routing problem
Emissions resulted from transportation activities may lead to dangerous effects on the whole environment and human health. According to sustainability principles, in recent years researchers attempt to consider the environmental burden of logistics activities in traditional logistics problems such as vehicle routing problems (VRPs). The pollution-routing problem (PRP) is an extension of the VRP...
متن کاملA new Simulated Annealing algorithm for the robust coloring problem
The Robust Coloring Problem (RCP) is a generalization of the well-known Graph Coloring Problem where we seek for a solution that remains valid when extra edges are added. The RCP is used in scheduling of events with possible last-minute changes and study frequency assignments of the electromagnetic spectrum. This problem has been proved as NP-hard and in instances larger than 30 vertices, meta-...
متن کاملApproximation Algorithms for the k-center Problem: An Experimental Evaluation
In this paper we deal with the vertex k-center problem, a problem which is a part of the discrete location theory. Informally, given a set of cities, with intercity distances specified, one has to pick k cities and build warehouses in them so as to minimize the maximum distance of any city from its closest warehouse. We examine several approximation algorithms that achieve approximation factor ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2010
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2010.01.001